Path planning with divergence-based distance functions
نویسندگان
چکیده
منابع مشابه
Path Planning with Divergence-Based Distance Functions
Distance functions between points in a domain are sometimes used to automatically plan a gradient-descent path towards a given target point in the domain, avoiding obstacles that may be present. A key requirement from such distance functions is the absence of spurious local minima, which may foil such an approach, and this has led to the common use of harmonic potential functions. Based on the ...
متن کاملPractical Distance Functions for Path-Planning in Planar Domains
Path planning is an important problem in robotics. One way to plan a path between two points x, y within a (not necessarily simply-connected) planar domain Ω, is to define a non-negative distance function d(x, y) on Ω × Ω such that following the (descending) gradient of this distance function traces such a path. This presents two equally important challenges: A mathematical challenge – to defin...
متن کاملModel Confidence Set Based on Kullback-Leibler Divergence Distance
Consider the problem of estimating true density, h(.) based upon a random sample X1,…, Xn. In general, h(.)is approximated using an appropriate in some sense, see below) model fƟ(x). This article using Vuong's (1989) test along with a collection of k(> 2) non-nested models constructs a set of appropriate models, say model confidence set, for unknown model h(.).Application of such confide...
متن کاملOn Divergence-based Distance Functions for Multiply-connected Domains
Given a finitely connected planar Jordan domain Ω, it is possible to define a divergence distance D(x, y) from x ∈ Ω to y ∈ Ω, which takes into account the complex geometry of the domain. This distance function is based on the concept of f -divergence, a distance measure traditionally used to measure the difference between two probability distributions. The relevant probability distributions in...
متن کاملPotential functions based sampling heuristic for optimal path planning
Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collisionfree, asymptotically optimal path regardless of obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slow convergence to optimal path solution. As a result it consumes high memory as well as time due to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 2018
ISSN: 0167-8396
DOI: 10.1016/j.cagd.2018.09.002